Speaker : Markus Nebel Keywords : Analysis of algorithms; string matching problem; Boxr-Moore-Horspod algorithm; average-case analysis of algorithms. Abstract : We propose a modified version of the Boxr-Moore-Horspod algorithm which changes the order of companions such that the probability for a mismatch is maximized. Afterwards an average-case analysis for the number of companions needed by this algorithm to search for a fixed pattern verses a random pattern of size within a random text is...

Topics: Mathematics, lecture

Speaker: Bernd Ammann Date: August 2003

Topics: Mathematics, lectures

Speaker : Kazuhiro Fujiwara

Topics: Mathematics, lecture

Speaker: Shakkar Smorodinsky Date: October, 2003

Topics: Mathematics, lectures

Speaker:Michael Joswig Date: Nov, 2003

Topics: Mathematics, lectures

Speaker: Sarial Har-Peled Date: October, 2003

Topics: Mathematics, lectures

Speaker: Meir Katchalski Date: November, 2003

Topics: Mathematics, lectures

Speaker: Alexander BeilinsonDate: Monday March 18, 2002 10:00 AM - 11:00 AM

Topics: Mathematics, Lectures

Speaker: Alexander BeilinsonDate: Thursday March 21, 2002 10:00 AM - 11:00 AM

Topics: Mathematics, Lectures

Speaker : Conrado Martinez Keywords: Analysis of algorithms; partial sorting; quicksort; quickselect; divide and conquer recurrences. Abstract: In this lecture I present a preliminary analysis of partial quicksort, a simple variant of quicksort which efficiently solves the partial sort problem. I also present similar results for chunksort, another generalization of quicksort which can be used to sort designated intervals of an array.

Topics: Mathematics, lecture

Speaker: Peter Brass Date: November, 2003

Topics: Mathematics, lectures

Speaker: Vincent Beffara Date: 05/04/01

Topics: Mathematics, lectures

Speaker: Joseph Mitchell Date: October, 2003

Topics: Mathematics, lectures

Speaker: Silke Slembek Date: April, 2003

Topics: Mathematics, lectures

NOTE: no sound in first 20 seconds Speaker : Bruno Salvy Keywords : Analysis of algorithms; Grobner bases; generic complexity; coalescence of saddle-points. Abstract : While the computation of Grobner bases is known to be an exsapace complete problem, the generic behavior of the algorithms for their bases and analyze precisely the best algorithm currently known.

Topics: Mathematics, lecture

Speaker : Matthias Flach

Topics: Mathematics, lecture

Speaker: Olaf Neumann Date: April 2003

Topics: Mathematics, Lectures

Speaker: Bernard Nienhuis Date: 05/04/01

Topics: Mathematics, lectures

Speaker: Gunther Frei Date: April, 2003

Topics: Mathematics, lectures

Speaker: Joachim Schwermer Date: April, 2003

( 1 reviews )

Topics: Mathematics, lectures

Speaker : Mark Dickinson

Topics: Mathematics, lecture

Speaker : Mark Dickinson

Topics: Mathematics, lecture

Speaker : Fred Diamond

Topics: Mathematics, lecture

Speaker : Richard Taylor

Topics: Mathematics, lecture

Speaker : Christophe Breuil

Topics: Mathematics, lecture

Speaker : Brian Conrad

Topics: Mathematics, lecture

Speaker: Shu Nakamura Date: May 2003

Topics: Mathematics, lectures

Speaker: Henry Cohn Date: November, 2003

Topics: Mathematics, lectures

Speaker : Jim Renegar

Topics: Mathematics, lecture

Speaker : Jim Renegar

Topics: Mathematics, lecture

Speaker : Jim Renegar

Topics: Mathematics, lecture

Speaker: Jesus De Loera Date: July 2003

Topics: Mathematics, Lectures

Speaker: Jesus De Loera Date: July 2003

Topics: Mathematics, Lectures

Speaker : Carlos Kenig

Topics: Mathematics, lecture

Speaker : Carlos Kenig

Topics: Mathematics, lecture

Speaker : Carlos Kenig

Topics: Mathematics, lecture

Speaker : Carlos Kenig

Topics: Mathematics, lecture

Speaker : Carlos Kenig

Topics: Mathematics, lecture

Speaker : Elkies

Topics: Mathematics, lecture

Speaker: Eti Ezra Date: October, 2003

Topics: Mathematics, lectures

Speaker : Neal Koblitz

Topics: Mathematics, lecture